Straight Skeletons for Binary Shapes Markus Demuth Institute for Theoretical Computer Science Graz University of Technology Franz Aurenhammer

Source URL: www.igi.tugraz.at

On Recognizing Graphs by Numbers of Homomorphisms Zdenˇek Dvoˇr´ak Charles University, Faculty of Mathematics and Physics, Institute for Theoretical Computer Science (ITI) 1 Malostransk´e n´

Source URL: iti.mff.cuni.cz

A simple proof for open cups and caps ˇ y Jakub Cern´ Department of Applied Mathematics and Institute for Theoretical Computer Science Charles University

Source URL: iti.mff.cuni.cz

Verifying an Open Compiler Using Multi-Language Semantics James T. Perconti and Amal Ahmed Northeastern University Abstract. Existing verified compilers are proved correct under a closed-world assumption, i.e., that the

Source URL: www.ccs.neu.edu

• Logic
• Theoretical computer science
• Automated theorem proving
• Logic programming
• Logical truth
• Propositional calculus
• Substitution
• Mathematical logic
• Security type system
• Symbol

Equideductive Logic and CCCs with Subspaces Paul Taylor Computer Laboratory University of Cambridge

Source URL: www.paultaylor.eu

• Logic
• Theoretical computer science
• Mathematical logic
• Automated theorem proving
• Logic programming
• Logical truth
• Propositional calculus
• Substitution
• Symbol
• General topology
• Cartesian closed category
• Lambda calculus

Hamiltonian index is NP-complete Zdenˇek Ryj´ aˇcek ∗ Department of Mathematics, University of West Bohemia, and Institute of Theoretical Computer Science (ITI),

Source URL: iti.mff.cuni.cz

Blocking visibility for points in general position ˇ´ı Matouˇ Jir sek Department of Applied Mathematics and Institute of Theoretical Computer Science (ITI)

Source URL: kam.mff.cuni.cz

Algorithmic Game Theory∗ Tim Roughgarden† May 12, 2009 1

Source URL: theory.stanford.edu

• Game theory
• Theory of computation
• Mathematics
• Theoretical computer science
• Algorithmic game theory
• Price of anarchy
• Algorithmic mechanism design
• Mechanism design
• Approximation algorithm
• PPAD
• Epsilon-equilibrium
• Computational complexity theory

Theoretical Computer Science–499 www.elsevier.com/locate/tcs The limits of !xed-order computation  Konstantinos Sagonas a;∗ , Terrance Swift b , David S. Warren b

Source URL: user.it.uu.se

On Symmetric Circuits and FPC Anuj Dawar University of Cambridge Computer Laboratory joint work with Matthew Anderson

Source URL: highlights-conference.org

• Complexity classes
• Theory of computation
• Theoretical computer science
• Circuit complexity
• Computational complexity theory
• Computer science
• Boolean circuit
• Logic in computer science
• NC
• P
• Circuit
• FO